An Optimal Property of Principal Components

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-optimal Differentially Private Principal Components

Principal components analysis (PCA) is a standard tool for identifying good lowdimensional approximations to data sets in high dimension. Many current data sets of interest contain private or sensitive information about individuals. Algorithms which operate on such data should be sensitive to the privacy risks in publishing their outputs. Differential privacy is a framework for developing trade...

متن کامل

Optimal Rank-based Testing for Principal Components

This paper provides parametric and rank-based optimal tests for eigenvectors and eigenvalues of covariance or scatter matrices in elliptical families. The parametric tests extend the Gaussian likelihood ratio tests of Anderson (1963) and their pseudo-Gaussian robustifications by Tyler (1981, 1983) and Davis (1977), with which their Gaussian versions are shown to coincide, asymptotically, under ...

متن کامل

Optimal Multi-class Classification with Principal Components

An approach to build a multi-class classifier is proposed in this paper. This approach consists of a derivation to show under which loss function an optimal classifier can be obtained. It also consists of a method of selection of principal components for multi-class classification through univariate logistic regressions. And it consists of a derivation of certain derivatives to rank the feature...

متن کامل

A COVERING PROPERTY IN PRINCIPAL BUNDLES

Let $p:Xlo B$ be a locally trivial principal G-bundle and $wt{p}:wt{X}lo B$ be a locally trivial principal $wt{G}$-bundle. In this paper, by using the structure of principal bundles according to transition functions, we show that $wt{G}$ is a covering group of $G$ if and only if $wt{X}$ is a covering space of $X$. Then we conclude that a topological space $X$ with non-simply connected universal...

متن کامل

Optimal Rank-Based Tests for Common Principal Components

This paper provides optimal testing procedures for the m-sample null hypothesis of Common Principal Components (CPC) under possibly non Gaussian and heterogenous elliptical densities. We first establish, under very mild assumptions that do not require finite moments of order four, the local asymptotic normality (LAN) of the model. Based on that result, we show that the pseudo-Gaussian test prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1965

ISSN: 0003-4851

DOI: 10.1214/aoms/1177699920